Quantum Finite Automata: a Language Acceptor Model
نویسندگان
چکیده
There exist an computational gap between the models that allowed to use quantum effects and that are not using quantum effects. Quantum Finite Automata (QFA), Quantum Pushdown Automata (QPDA), Quantum branching are several computational models. Some computational models are more powerful than classical counterparts and some are not. In this survey work, we have drawn a comparison among 1-way QFA, 2-way QFA and 1.5-way QFA. Also we have discussed about the strengths and weakness of all these QFA models and the power of Quantum Finite State Automata. Keywords— Quantum Finite Automata (QFA);Quantum Pushdown Automata(QPDA); 1-way Quantum Finite Automata (1QFA) ;2-way Quantum Finite Automata (2QFA);1.5-way Quantum Finite Automata (1.5QFA)
منابع مشابه
Watson-Crick Quantum Finite Automata
one-way quantum finite automata are reversible in nature, which greatly reduces its accepting property. In fact, the set of languages accepted by one-way quantum finite automata is a proper subset of regular languages. In this paper, we replace the tape head of one-way quantum finite automata with DNA double strand and name the model Watson-Crick quantum finite automata. The noninjective comple...
متن کاملMultidimensional fuzzy finite tree automata
This paper introduces the notion of multidimensional fuzzy finite tree automata (MFFTA) and investigates its closure properties from the area of automata and language theory. MFFTA are a superclass of fuzzy tree automata whose behavior is generalized to adapt to multidimensional fuzzy sets. An MFFTA recognizes a multidimensional fuzzy tree language which is a regular tree language so that for e...
متن کاملQuantum Finite Automata and Weighted Automata
Quantum finite automata derive their strength by exploiting interference in complex valued probability amplitudes. Of particular interest is the 2-way model of Ambainis and Watrous that has both quantum and classical states (2QCFA) [A. Ambainis and J. Watrous, Two-way finite automata with quantum and classical state, Theoretical Computer Science, 287(1), pp. 299-311, 2002], since it combines th...
متن کاملProbabilistic and quantum finite automata with postselection
We prove that endowing a real-time probabilistic or quantum computer with the ability of postselection increases its computational power. For this purpose, we provide a new model of finite automata with postselection, and compare it with the model of L¯ ace et al. We examine the related language classes, and also establish separations between the classical and quantum versions, and between the ...
متن کاملQuantum Finite Automata and Weighted Automata
Quantum finite automata derive their strength by exploiting interference in complex valued probability amplitudes. Of particular interest is the 2-way model of Ambainis and Watrous that has both quantum and classical states (2QCFA) [A. Ambainis and J. Watrous, Two-way finite automata with quantum and classical state, Theoretical Computer Science, 287(1), pp. 299-311, 2002], since it combines th...
متن کامل